A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
نویسندگان
چکیده
منابع مشابه
Network Simplex Algorithm associated with the Maximum Flow Problem
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur in the network simplex algorithm associated with the maximum flow problem.
متن کاملUse of dynamic trees in a network simplex algorithm for the maximum flow problem
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(nZm) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm log n). This bound is less than a loga...
متن کاملA Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. We present a fully combinatorial description of the algorithm that is based on a novel incorporatio...
متن کاملThe maximum flow problem of uncertain network
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1988
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.31.551